Compositional abstraction refinement for control synthesis
نویسندگان
چکیده
منابع مشابه
Compositional abstraction refinement for control synthesis
This paper presents a compositional approach to specification-guided abstraction refinement for control synthesis of a nonlinear system associated with a method to over-approximate its reachable sets. Given an initial coarse partition of the state space, the control specification is given as a sequence of the cells of this partition to visit at each sampling time. The dynamics are decomposed in...
متن کاملAbstraction Refinement for Termination
ion Refinement for Termination⋆ Byron Cook, Andreas Podelski, and Andrey Rybalchenko 1 Microsoft Research, Cambridge 2 Max-Planck-Institut für Informatik, Saarbrücken Abstract. Abstraction can often lead to spurious counterexamples. Counterexample-guided abstraction refinement is a method of strengthening abstractions based on the analysis of these spurious counterexamples. For invariance prope...
متن کاملSynthesis of Supervisory Controllers for Hybrid Systems Using Abstraction Refinement
For the computationally challenging task of synthesizing supervisory controllers for hybrid systems, this paper suggests to use guided abstraction refinement. Starting from a discrete abstraction of the hybrid model, so-called candidate paths are determined as possible controlled evolutions which satisfy given specifications for safety and goal attainment. A specialized validation procedure is ...
متن کاملCompositional abstraction for networks of control systems: A dissipativity approach
In this paper we propose a compositional scheme for the construction of abstractions for networks of control systems using the interconnection matrix and joint dissipativity-type properties of subsystems and their abstractions. In the proposed framework, the abstraction, itself a control system (possibly with a lower dimension), can be used as a substitution of the original system in the contro...
متن کاملCompositional Abstraction for Concurrent Programs
We present a methodology for automatically constructing an abstraction of concurrent programs against safety specifications based on finite state machine. And then automatically extract an initial abstract model from source code using predicate abstraction and theorem proving. However, the process of extracting a finite model from a program using predicate abstraction can be exponential in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinear Analysis: Hybrid Systems
سال: 2018
ISSN: 1751-570X
DOI: 10.1016/j.nahs.2017.10.006